Transient analysis of a single server queueing system with infinite buffer
نویسندگان
چکیده
منابع مشابه
two server queueing system with single and batch service
a two server queueing system with single and batch service is considered in this paper. the arrival process is assumed to be poisson and the service rate follows an exponential distribution. server-i serves the customers in both single and batch service, while server-ii serves the customers in batch service only. the laplace transform of the transient and steady state behavior of the model is c...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملBuffer allocation in general single-server queueing networks
The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the constraints or both are usually not available in closed-form, making the problem even harder. A good approximation for the performance measures is thus essential for a successful buffer allocation algorithm. A recently p...
متن کاملAnalysis of a Batch Arrival Single Service Queueing System with Unreliable Server and Single Vacation
Many authors have analyzed queueing systems with server breakdowns. Kendall (1953) studied stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chains. Buzacott and Hanifin (1978) classified the machine failures as operation dependent failures and time dependent failures. Shanthikumar (1982) analyzed a M/G/1 queueing system with time and ope...
متن کاملServer optimization of infinite queueing systems
The problem of optimizing Markovian models with infinitely or finite but infeasible large state space is considered. In several practically interesting cases the state space of the model is finite and extremely large or infinite, and the transition and decision structures have some regular property which can be exploited for efficient analysis and optimization. Among the Markovian models with r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2021
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/2020119